SB3C2016 Abstract Template
نویسندگان
چکیده
INTRODUCTION Quantifying the flow dynamics in cerebral aneurysms is important to understand the mechanisms responsible for aneurysm progression and rupture and develop improved aneurysm risk assessment procedures (diagnosis) as well as for understanding and evaluating endovascular interventions such as flow diversion (treatment). Many studies have used computational fluid dynamics (CFD) to model the flow in cerebral aneurysms to study rupture as well as flow diversion treatments. On the other hand, attempts at measuring the in vivo flow fields have been made with phase-contrast magnetic resonance as well as dynamic angiographic velocimetry [1]. The latter technique is attractive because it can be carried out during the angiographic evaluation of the aneurysm or during its endovascular treatment. Previous studies have shown the potential clinical value of the angiography-based flow quantification and have compared the results to Doppler ultrasound and synthetic angiograms generated from CFD simulations [2, 3]. The purpose of our study was to further evaluate the angiography-based flow field quantification by comparing against patient-specific CFD models with angiographic aneurysm patient data.
منابع مشابه
Polynomial Template Generation using Sum-of-Squares Programming
Template abstract domains allow to express more interesting properties than classical abstract domains. However, template generation is a challenging problem when one uses template abstract domains for program analysis. In this paper, we relate template generation with the program properties that we want to prove. We focus on one-loop programs with nested conditional branches. We formally defin...
متن کاملUsing Template Haskell for Abstract Interpretation
Metaprogramming consists of writing programs that generate or manipulate other programs. Template Haskell is a recent extension of Haskell, currently implemented in the Glasgow Haskell Compiler, giving support to metaprogramming at compile time. Our aim is to apply these facilities in order to statically analyse programs and transform them at compile time. In this paper we use Template Haskell ...
متن کاملTowards a Text Generation Template Language for Modelica
The uses, needs, and requirements of a text generation template language for Modelica are discussed. A template language may allow more concise and readable programming of the generation of textual models, program code, or documents, from a structured model representation such as abstract syntax trees (AST). Applications can be found in generating simulation code in other programming languages ...
متن کاملTemplate-Based Unbounded Time Verification of Affine Hybrid Automata
Computing over-approximations of all possible time trajectories is an important task in the analysis of hybrid systems. Sankaranarayanan et al. [20] suggested to approximate the set of reachable states using template polyhedra. In the present paper, we use a max-strategy improvement algorithm for computing an abstract semantics for affine hybrid automata that is based on template polyhedra and ...
متن کاملGeneration Mechanisms in Graphical Template Language
Textual models in MDD typically are generated in their concrete syntax using a template based language. On the contrary, graphical models as a rule are generated in abstract syntax and then visualized, which is not very efficient for complicated languages. The paper discusses a case of template based generation of graphical models in a concrete syntax. We apply this approach to generation of pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016